A Double Team Semantics for Generalized Quantifiers
نویسندگان
چکیده
منابع مشابه
A Double Team Semantics for Generalized Quantifiers
We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of a generalized atom. We define a system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework. The semantics is based on pairs of teams, or double teams. We als...
متن کاملEncoding Generalized Quantifiers in Dependency-based Compositional Semantics
For textual entailment recognition systems, it is often important to correctly handle Generalized quantifiers (GQ). In this paper, we explore ways of encoding GQs in a recent framework of Dependency-based Compositional Semantics, especially aiming to correctly handle linguistic knowledge like hyponymy when GQs are involved. We use both the selection operator mechanism and a new relation extensi...
متن کاملComputational semantics for monadic quantifiers
The paper gives a survey of known results related to computational devices (finite and push–down automata) recognizing monadic generalized quantifiers in finite models. Some of these results are simple reinterpretations of descriptive—feasible correspondence theorems from finite–model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven...
متن کاملGeneralized Quantifiers
We review recent work in the field of generalized quantifiers on finite models. We give an idea of the methods that are available in this area. Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models.
متن کاملTheory Comparison for Generalized Quantifiers
Premises and conclusions in classical syllogistic reasoning are formed using one of four quantifiers (All, Some, Some not, None). In everyday communication and reasoning, however, statements such as “most” and “few” are formed as well. So far only Chater and Oaksford’s (1999) Probability Heuristics Model (PHM) makes predictions for these so-called generalized quantifiers. In this article we (i)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic, Language and Information
سال: 2015
ISSN: 0925-8531,1572-9583
DOI: 10.1007/s10849-015-9217-4